Multi-objective Optimization for Design of Single Row Layout in Flexible Manufacturing System with Scheduling Constraint:an Approach of Non- Traditional Optimization Techniques

نویسندگان

  • K. MALLIKARJUNA
  • V. VEERANNA
  • K. HEMACHANDRA REDDY
چکیده

Single row layout is one of the most usually used layout patterns in industries, particularly in flexible manufacturing systems. Here actual sequencing of machine and arrangement of parts, no doubt, have a great influence on the throughput of the flexible manufacturing system i.e., (F.M.S). This paper discusses the single row layout design in flexible manufacturing system (F.M.S). This paper furnishes the design, development and testing of simulated annealing technique and genetic algorithm to solve the single row layout problem by considering multi-objective i.e., minimizing the make span of jobs on all machines and minimizing the total transportation cost. The various line layout problems are tested for performance of objective function with respect to computational time and number of iterations involved in GA and SA. A necessary code is generated in C++ and the code is run by the IDE tool in which C++ compiler used as plug in. This tool has Eclipse based features which affords the competency to figure, correct, steer, and sort out the tasks that use C++ as a programming language using Intel core i3-380M processor. The results of the different optimization algorithms (Genetic Algorithm and simulated annealing method) are compared and finally, we observed that GA provide optimum results than SA KeywordsFlexible Manufacturing system;Genetic Algorithm;Makespan;single row layout;Simulated Annealing; Transportation Cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY

The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...

متن کامل

A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system

The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to...

متن کامل

A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment

In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007